On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions

We consider the problem of evaluating a functional expression comprising the nested sums and infimal convolutions of convex piecewise-linear functions defined on the reals. For the special case where the nesting is serial, we give an O(NlogN) time algorithm, where N is the total nunber of breakpoints of the functions. We also prove a lower bound of fl(N log N) on the number of comparisons neede...

متن کامل

Computing the conjugate of convex piecewise linear-quadratic bivariate functions

We present a new algorithm to compute the Legendre–Fenchel conjugate of convex piecewise linear-quadratic (PLQ) bivariate functions. The algorithm stores a function using a (primal) planar arrangement. It then computes the (dual) arrangement associated with the conjugate by looping through vertices, edges, and faces in the primal arrangement and building associated dual vertices, edges, and fac...

متن کامل

ANOVA decomposition of convex piecewise linear functions

Piecewise linear convex functions arise as integrands in stochastic programs. They are Lipschitz continuous on their domain, but do not belong to tensor product Sobolev spaces. Motivated by applying Quasi-Monte Carlo methods we show that all terms of their ANOVA decomposition, except the one of highest order, are smooth if the underlying densities are smooth and a certain geometric condition is...

متن کامل

Computing Correlation between Piecewise-Linear Functions

We study the problem of computing correlation between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral terrains—can be transformed vertically by a linear transformation of the third coordinate (scaling and translation). We present a randomized algorithm that minimizes the maximum vertical distance between the graphs of the tw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algorithms

سال: 1996

ISSN: 0196-6774

DOI: 10.1006/jagm.1996.0045